Partiality and Adjointness in Modal Logic
نویسنده
چکیده
Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual finite formula (modulo equivalence) to be a possibility, rather than each infinite maximally consistent set of formulas as in the usual canonical world models. Constructing these locally finite canonical models involves solving a problem in general modal logic of independent interest, related to the study of adjoint pairs of modal operators: for a given modal logic L, can we find for every formula φ a formula f a (φ) such that for every formula ψ, φ→ 2aψ is provable in L if and only if f a (φ) → ψ is provable in L? We answer this question for a number of standard modal logics, using model-theoretic arguments with world semantics. This second main result allows us to build for each logic a canonical possibility model out of the lattice of formulas related by provable implication in the logic.
منابع مشابه
On monotone modalities and adjointness
We fix a logical connection (Stone Pred : Set op −→ BA given by 2 as a schizophrenic object) and study coalgebraic modal logic that is induced by a functor T : Set −→ Set which is finitary, standard, preserves weak pullbacks and finite sets. We prove that for any such T , the cover modality nabla is a left (and its dual delta is a right) adjoint relative to Pω. We then consider monotone unary m...
متن کاملA Modal Logic for Observation-Based Knowledge Representation
In this paper, we introduce and explore ways to include a notion of partiality of information in knowledge representation formalisms. This leads to the definition of an algebraic structure based on observation and partial representation, and to the study of the logical behaviour of those structures, with the characterization of a new modal logic called OL.
متن کاملModes of Adjointness
The fact that many modal operators are part of an adjunction is probably folklore since the discovery of adjunctions. On the other hand, the natural idea of a minimal propositional calculus extended with a pair of adjoint operators seems to have been formulated only very recently. This recent research, mainly motivated by applications in computer science, concentrates on technical issues relate...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملFunctional Programming with Names and Necessity
All programs interact with their environments in one way or another: they read and write to memory, query users for input, print out results, send data to remote servers, etc. Because increasingly complex environments result in increasingly difficult and error-prone programming, programming languages should facilitate compile-time detection of erroneous interactions with environments. In this d...
متن کامل